Average-Case Approximation Ratio of Scheduling without Payments
نویسندگان
چکیده
منابع مشابه
Average-case Approximation Ratio of Scheduling without Payments
Apart from the principles and methodologies inherited from Economics and Game Theory, the studies in Algorithmic Mechanism Design typically employ the worst-case analysis and approximation schemes of Theoretical Computer Science. For instance, the approximation ratio, which is the canonical measure of evaluating how well an incentive-compatible mechanism approximately optimizes the objective, i...
متن کاملN ov 2 01 7 Average - case Approximation Ratio of Scheduling without Payments
Apart from the principles and methodologies inherited from Economics and Game Theory, the studies in Algorithmic Mechanism Design typically employ the worst-case analysis and approximation schemes of Theoretical Computer Science. For instance, the approximation ratio, which is the canonical measure of evaluating how well an incentive-compatible mechanism approximately optimizes the objective, i...
متن کاملAverage-case approximation ratio of the 2-opt algorithm for the TSP
The traveling salesman problem (TSP) is one of the most important problems in combinatorial optimization: Given a complete graph with edge weights, the goal is to find a Hamiltonian cycle (also called a tour) of minimum weight. 2-opt is probably the most widely used local search heuristic for the TSP. It incrementally improves an initial tour by exchanging two edges of the tour with two other e...
متن کاملList's worst-average-case or WAC ratio
We analyze the List scheduling algorithm for the problem of minimizing makespan using a worst-average-case or wac analysis technique, previously used by Kenyon for analyzing the Best Fit bin packing algorithm. We show that List’s worst-average-case or wac ratio asymptotically approaches 2 as m→∞. Thus, List’s worst-case behavior is not overly dependent on the order of job arrivals.
متن کاملTwo competitive ratio approximation schemes for a classical scheduling problem
For a long time, optimal competitive factors of online algorithms used to be approximated by manually finding and improving upper and lower bounds. The concept of a competitive ratio approximation scheme (CRAS), introduced by Günther et al. in 2012 [13], defines a method of reducing this process to a task that can be executed automatically by a computer up to an arbitrarily good precision: A CR...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Algorithmica
سال: 2021
ISSN: 0178-4617,1432-0541
DOI: 10.1007/s00453-020-00796-2